Fast Transform into Polar Coordinates by Generalized DDA.
نویسندگان
چکیده
منابع مشابه
Nonlinear Transform Coding with Lossless Polar Coordinates
In conventional transform coding, the importance of preserving desirable quantization partition cell shapes prevents one from considering the use of a nonlinear change of variables. If no linear transformation of a given source would yield independent components, this means having to encode it at a rate higher than its entropy, i.e. suboptimally. This thesis proposes a new transform coding tech...
متن کاملFast Laser Scan Matching using Polar Coordinates
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of the laser measurements and eliminates the need for an expensive search for corresponding points in other scan match approaches. PSM belongs to the family of point to point scan matching approaches with its matching bearin...
متن کاملGENERAL SOLUTION OF ELASTICITY PROBLEMS IN TWO DIMENSIONAL POLAR COORDINATES USING MELLIN TRANSFORM
Abstract In this work, the Mellin transform method was used to obtain solutions for the stress field components in two dimensional (2D) elasticity problems in terms of plane polar coordinates. the Mellin transformation was applied to the biharmonic stress compatibility equation expressed in terms of the Airy stress potential function, and the boundary value problem transformed to an algebraic ...
متن کاملFast Inversion of the Radon Transform Using Log-polar Coordinates and Partial Back-Projections
In this paper a novel filtered back-projection algorithm for inversion of a discretized Radon transform is presented. It makes use of invariance properties possessed by both the Radon transform its dual. By switching to log-polar coordinates, both operators can be expressed in a displacement invariant manner. Explicit expressions for the corresponding transfer functions are calculated. Furtherm...
متن کاملFast generalized Hough transform
A fast algorithm for the generalized Hough transform (GHT) based on the use of a hierarchical processing scheme and the inverse generalized Hough operation is proposed. By reducing the size of the image portion which need be processed in the proposed fast GHT, not only the computation time but also the number of processing elements for parallel processing can be reduced. The way to apply the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan
سال: 1993
ISSN: 0386-6831,1884-9652
DOI: 10.3169/itej1978.47.97